On potentially (K4-e)-graphic sequences
نویسندگان
چکیده
In this paper, we characterize the potentially (K4 − e)-graphic sequences where K4 − e is the graph obtained from K4 by removing one edge. This characterization implies a theorem due to C. H. Lai (Australas. J. Combin. 24 (2001), 123–127) and a characterization of potentially C4graphic sequences due to R. Luo (Ars Combin. 64 (2002), 301–318).
منابع مشابه
A ug 2 00 3 A note on potentially K 4 − e graphical sequences ∗
A sequence S is potentially K4 − e graphical if it has a realization containing a K4 − e as a subgraph. Let σ(K4 − e, n) denote the smallest degree sum such that every n-term graphical sequence S with σ(S) ≥ σ(K4 − e, n) is potentially K4 − e graphical. Gould, Jacobson, Lehel raised the problem of determining the value of σ(K4 − e, n). In this paper, we prove that σ(K4 − e, n) = 2[(3n− 1)/2] fo...
متن کاملA note on potentially K4-e graphical sequences
A sequence S is potentially K4 e graphical if it has a realization containing a K4 e as a subgraph. Let 0'(K4 e, n) denote the smallest degree sum such that every n-term graphical sequence S with O'(S) 2: a(I{4 e, n) is potentially K4 e graphical. Gould, Jacobson, Lehel raised the problem of determining the value of 0'(K4 e, n). In this paper, we prove that 0'(K4 e, n) = 2[(317, 1)/2] for 17, 2...
متن کامل. C O ] 1 0 Ja n 20 09 A Characterization On Potentially K 2 , 5 - graphic Sequences ∗
For given a graphH , a graphic sequence π = (d1, d2, · · · , dn) is said to be potentially H-graphic if there exists a realization of π containing H as a subgraph. Let Km −H be the graph obtained from Km by removing the edges set E(H) where H is a subgraph of Km. In this paper, we characterize the potentially K2,5-graphic sequences. This characterization implies a theorem due to Yin et al. [15].
متن کامل1 0 Ja n 20 09 A Characterization On Potentially K 6 − C 4 - graphic Sequences ∗
For given a graphH , a graphic sequence π = (d1, d2, · · · , dn) is said to be potentially H-graphic if there exists a realization of π containing H as a subgraph. Let Km −H be the graph obtained from Km by removing the edges set E(H) where H is a subgraph of Km. In this paper, we characterize the potentially K6 − C4-graphic sequences. This characterization implies a theorem due to Hu and Lai [7].
متن کاملar X iv : m at h / 07 02 24 5 v 2 [ m at h . C O ] 1 7 Se p 20 07 On Potentially K 5 − E 3 - graphic Sequences ∗
Let Km −H be the graph obtained from Km by removing the edges set E(H) of H where H is a subgraph of Km. In this paper, we characterize the potentially K5 − P3, K5 − A3, K5 −K3 and K5 − K1,3-graphic sequences where A3 is P2 ∪ K2. Moreover, we also characterize the potentially K5 − 2K2-graphic sequences where pK2 is the matching consisted of p edges.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 29 شماره
صفحات -
تاریخ انتشار 2004